Improved Tightened Milp Formulations for Single-stage Batch Scheduling Problems

نویسندگان

  • Pablo A. Marchetti
  • Jaime Cerdá
چکیده

This work presents a set of improved MILP mathematical formulations for the scheduling of single-stage batch plants with parallel production lines. Minimization of the average weighted earliness and the makespan, i.e. the time needed to complete all processing tasks, are considered as alternative problem goals. For each objective function an enhanced model that incorporates specific tightening constraints is presented. These constraints improve each model’s efficiency by increasing the corresponding objective function lower bound, thus accelerating the branch and bound node pruning process. Several problem instances with different number of batches demonstrate that the proposed approach reduces the computational effort by orders of magnitude. Sequence dependent setup times can also be effectively accommodated. Copyright © 2006 IFAC

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A MILP model for single machine family scheduling with sequence-dependent batch setup and controllable processing times

A mathematical programming model for a class of single machine family scheduling problems is described in this technical report, with the aim of comparing the performance in solving the scheduling problem by means of mathematical programming with the performance obtained when using optimal control strategies, that can be derived from the application of a dynamic programming-based methodology pr...

متن کامل

An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

متن کامل

A New General Continuous-Time State Task Network Formulation for Short-Term Scheduling of Multipurpose Batch Plants

A new continuous time MILP model for the short-term scheduling of multipurpose batch plants is presented. The proposed model relies on the State Task Network (STN) and addresses the general problem of batch scheduling, accounting for resource (utility) constraints, variable batch sizes and processing times, various storage policies (UIS/FIS/NIS/ZW), batch mixing/splitting, and sequencedependent...

متن کامل

An Improved Formulation For Scheduling Multipurpose Batch Plants Using Synchronous Slots

Several continuous-time formulations in the literature address the most demanding problem of scheduling in multipurpose batch plants. These formulations can be broadly classified into two types based on the assignment binary variables. They are (i) Formulations with decoupling and (ii) ones without decoupling. The former rely on the postulation that decoupling the tasks from units reduces the n...

متن کامل

Two New Continuous-time Models for the Scheduling of Multistage Batch Plants with Sequence Dependent Changeovers

This paper presents two new multiple-time grid, continuous-time mixed integer linear program (MILP) models for the short-term scheduling of multistage, multiproduct plants featuring equipment units with sequence dependent changeovers. Their main difference results from the explicit consideration of changeover tasks as model variables rather than implicitly through model constraints. The former ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006